Planar graph bipartization in linear time
نویسندگان
چکیده
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transversal of size at most k.
منابع مشابه
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
A b s t r a c t . Given a subset of cycles of a graph, we consider the problem of finding a minimum-weight set of vertices that meets all cycles in the subset. This problem generalizes a number of problems, including the minlmum-weight feedback vertex set problem in both directed and undirected graphs, the subset feedback vertex set problem, and the graph bipartization problem~ in which one mus...
متن کاملRevisiting the Layout Decomposition Problem for Double Patterning Lithography
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures) if their spacing is less than the minimum coloring spacing. 11, 14 However, there exist pattern configurations for which pattern features separated by less than the minimum coloring spacing cannot be assigned different...
متن کاملImproved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most 4. Our main results include: 1. an O(1.9526) 1 algorithm for Vertex Bipartization problem in undirected graphs; 2. an O(1.8384) algorithm for Vertex Bipartization problem in undirected graphs of maximum degree 3; 3. an O(1.945...
متن کاملAlgorithm Engineering for Optimal Graph Bipartization
We examine exact algorithms for the NP-hard Graph Bipartization problem. The task is, given a graph, to find a minimum set of vertices to delete to make it bipartite. Based on the “iterative compression” method introduced by Reed, Smith, and Vetta in 2004, we present new algorithms and experimental results. The worst-case time complexity is improved. Based on new structural insights, we give a ...
متن کاملEdge Bipartization Faster Than 2^k
In the Edge Bipartization problem one is given an undirected graph G and an integer k, and the question is whether k edges can be deleted from G so that it becomes bipartite. In 2006, Guo et al. [6] proposed an algorithm solving this problem in time O(2 ·m2); today, this algorithm is a textbook example of an application of the iterative compression technique. Despite extensive progress in the u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 19 شماره
صفحات -
تاریخ انتشار 2005